Hypertree-decomposition via Branch-decomposition
نویسنده
چکیده
Hypertree-decomposition is the most general approach in the literature for identifying tractable computation problems encoded as hypergraphs. We show how the heuristic branch-decomposition approach for ordinary graphs of [Cook and Seymour, 2003] can be used for the heuristic construction of hypertree-decompositions.
منابع مشابه
New Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions
Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus man...
متن کاملCombining hypertree, bicomp, and hinge decomposition
Solving Constraint Satisfaction Problems (CSP) is in general NP-complete. If the structure of the CSP is a tree, then the computation can be done very effectively in a backtrack-free manner. There are several methods for converting CSPs in their treestructured equivalent, e.g., hinge decomposition. More recently hypertree decomposition was developed and proved to subsume all other previously de...
متن کاملBacktracking Procedures for Hypertree, HyperSpread and Connected Hypertree Decomposition of CSPs
Hypertree decomposition has been shown to be the most general CSP decomposition method. However, so far the exact methods are not able to find optimal hypertree decompositions of realistic instances. We present a backtracking procedure which, along with isomorphic component detection, results in optimal hypertree decompositions. We also make the procedure generic; variations of which results in...
متن کاملReducing Redundancy in the Hypertree Decomposition Scheme
Hypertree decomposition is a powerful technique for transforming near-acyclic CSPs into acyclic CSPs. Acyclic CSPs have efficient, polynomial time solving techniques, and so these conversions are of interest to the constraints community. We present here an improvement on the opt-k-decomp algorithm for finding an optimal hypertree decomposition. Abstract Hypertree decomposition is a powerful tec...
متن کاملHeuristic Methods for Hypertree Decomposition
The literature provides several structural decomposition methods for identifying tractable subclasses of the constraint satisfaction problem. Generalized hypertree decomposition is the most general of such decomposition methods. Although the relationship to other structural decomposition methods has been thoroughly investigated, only little research has been done on efficient algorithms for com...
متن کامل